Determination of Yield Bounds Prior to Routing
نویسندگان
چکیده
Integrated Circuit manufacturing complexities have resulted in decreasing product yields and reliabilities. This process has been accelerated with the advent of very deep sub-micron technologies coupled with the introduction of newer materials and technologies like copper interconnects, siliconon-insulator and increased wafer sizes. The need to improve product yields has been recognized and currently some yield enhancement techniques are used in industry CAD tools. Still, the signi cant increase in problem size implies that considerable time and e ort can be saved if the designer could predict the yield of each design stage. In this paper we undertake an e ort to derive bounds on the yield of the routing for a given placement. When the design is routed, resulting in a yield which is signi cantly smaller than the bound, the designer can choose to change the router cost functions, modify the placement or even re-design the unit in an attempt to increase the yield. We compare the bounds on yield obtained for a set of standard benchmarks against exact yield values for the \vanilla" routings, and the run times needed to calculate the two. The results indicate that reasonably good estimates of yield can be obtained in signi cantly lower amounts of run time. The accuracy of the estimates increases when larger designs are considered as the simplifying assumptions made in the model no longer in uence the estimates signi cantly.
منابع مشابه
The Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملAcceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کاملA Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Single-sided Time Window Setting
Customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. Delivery quality has several parameters such as deliver time window options, time window size, etc. In this paper we focus on one of these parameters, namely time window setting. It has a direct impact upon customer satisfaction and busi...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملAvoiding the Range of Equivalence in Clinical Trials: Bayesian Sample Size Determination for Robust Credible Intervals
This article considers sample size determination methods based on Bayesian credible intervals for θ, an unknown real-valued parameter of interest. We assume that credible intervals are used to establish whether θ belongs to an indifference region. This problem is typical in clinical trials, where θ represents the effect-difference of two alternative treatments and experiments are judged conclus...
متن کامل